A Scatter Search Algorithm for the RCPSP with Discounted Weighted Earliness-Tardiness Costs
نویسندگان
چکیده
In this paper, we study a resource-constrained project scheduling problem in which a set of project activities have due dates. If the finish time of each one of these activities is not equal to its due date, an earliness or a tardiness cost exists for each tardy or early period. The objective is to minimize the sum of discounted weighted earliness-tardiness penalty costs of these activities. Scatter Search algorithm is used to deal with this extended form of resource-constrained project scheduling problem. Our implementation of Scatter Search integrates the advanced methods such as dynamic updating of the reference set and the use of frequency-based memory within the diversification generator. Finally, some small and medium size test problems are examined and the computational results are presented. The computational results show the efficiency of the proposed meta-heuristic procedure. [Mohammad Khalilzadeh, FereydoonKianfar , Mohammad Ranjbar. A Scatter Search Algorithm for RCPSP with Discounted Weighted Earliness-Tardiness Costs. Life Science Journal. 2011;8(2):634-640] (ISSN:1097-8135). http://www.lifesciencesite.com.
منابع مشابه
حل مسئله زمان بندی ماشینهای موازی نامرتبط با اهداف کل زودکرد وزنی و کل دیرکرد وزنی با استفاده از الگوریتم جستجوی پراکنده چند هدفه
The parallel machine scheduling problem is an important and difficult problem to be considered in the real-world situations. Traditionally, this problem consists of the scheduling of a set of independent jobs on parallel machines with the aim of minimizing the maximum job completion. In today's manufacturing systems, in which both early and tardy finishing of job processing are undesired, the o...
متن کاملA Local Search Approach to the Resource Constrained Project Scheduling Problem to Minimize Convex Costs
As the resource constrained project scheduling problem (RCPSP) has a wide range of applications, its models, extensions and algorithms have been intensively studied [2]. As for objective functions, makespan minimization has commonly been used, while the importance of non-regular ones such as earliness-tardiness are also recognized. In this paper, we introduce a time-lag cost, which is charged a...
متن کاملElectromagnetism-like algorithm for fuzzy flow shop batch processing machines scheduling to minimize total weighted earliness and tardiness
In this paper, we study a flow shop batch processing machines scheduling problem. The fuzzy due dates are considered to make the problem more close to the reality. The objective function is taken as the weighted sum of fuzzy earliness and fuzzy tardiness. In order to tackle the given problem, we propose a hybrid electromagnetism-like (EM) algorithm, in which the EM is hybridized with a diversi...
متن کاملAn Exact Procedure for the Resource-Constrained Weighted Earliness-Tardiness Project Scheduling Problem
In this paper we study the resource-constrained project scheduling problem with weighted earliness-tardiness penalty costs. Project activities are assumed to have a known deterministic due date, a unit earliness as well as a unit tardiness penalty cost and constant renewable resource requirements. The objective is to schedule the activities in order to minimize the total weighted earliness-tard...
متن کاملFuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flowtime through Genetic Algorithm
Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters with it, this is why in recent decades extensive researches have been done on scheduling issues. A type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical ...
متن کامل